package www.com.zhongge.application;

/**
 * @ClassName Test
 * @Description TODO 测试类
 * @Author 笨忠
 * @Date 2025/7/24 15:27
 * @Version 1.0
 */
public class Test {
    /**
     * 出入栈次序
     * @param args
     */
    public static void main(String[] args) {
        int[] pushV = {2, 1, 0};
        int[] popV = {1, 2, 0};
        System.out.println(new SequenceMatching().IsPopOrder(pushV, popV));
    }
    /**
     * 测试：最小栈
     * @param args
     */
    public static void main1(String[] args) {
        MinStack minStack = new MinStack();
        //入栈
        minStack.push(512);
        minStack.push(-1024);
        minStack.push(-1024);
        minStack.push(512);

        System.out.println(minStack.getMin());
        minStack.pop();
        System.out.println(minStack.top());
        System.out.println(minStack.getMin());
    }
}
